Reconstruction of Parallel Line Segments From Endpoint Visibility Information
نویسنده
چکیده
In general, visibility reconstruction problems involve determining a set of objects in the plane that exhibit a speci ed set of visibility constraints. In this paper, an algorithm for reconstructing a set of parallel line segments is presented, from speci ed visibility information contained in an extended endpoint visibility graph. The algorithm runs in polynomial time and relies on simple vector arithmetic to generate a system of linear inequalities.
منابع مشابه
Computing the Visibility Polygons of the Endpoints of a Set of Line Segments in Output Sensitive Time
Given a set S of n non-intersecting line segments in the plane, we present an algorithm that computes the 2n visibility polygons of the endpoints of S, in output sensitive time. The algorithm relies on the ordered endpoint visibility graph information to traverse the endpoints of S in a spiral-like manner using a combination of Jarvis' March and depthrst search. One extension of this result is ...
متن کاملOn a planar matching in line segments endpoints visibility graph
We show that the segment endpoint visibility graph of any finite set of 2n line segments contains a planar matching that does not use any segment edge, if the line segments in our set are convexly independent.
متن کاملAlternating Paths along Orthogonal Segments
It was shown recently that in the segment endpoint visibility graph Vis(S) of any set S of n disjoint line segments in the plane, there is an alternating path of length (log n), and this bound best possible apart from a constant factor. This talk focuses on the variant of the problem where S is a set of n disjoint axis-parallel line segments, and shows that the length of a longest alternating p...
متن کاملSegment endpoint visibility graphs are hamiltonian
We show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. This proves a conjecture of Mirzaian.
متن کاملAlternating paths through disjoint line segments
We show that every segment endpoint visibility graph on disjoint line segments in the plane admits an alternating path of length , answering a question of Bose. This bound is optimal apart from a constant factor. We also give bounds on the constants hidden by the asymptotic notation.
متن کامل